Numerically stable algorithm for pole assignment of linear single-input systems

Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library An efficient computational algorithm for pole assignment of linear single-input systems is presented. It is based on orthogonal reduction of the closed-loop system matrix to upper (quasi) triangular form whose 1 X 1 or 2 X 2 diagonal blocks correspond to the desired poles. A detailed numerical analysis of the algorithm is made which shows that it is unconditionally stable. The number of computational operations is approximately 6n 3 , the necessary array storage being 2n 2 + 6n working precision words, where n is the order of the system.